Minimum Depth Graph Embedding
نویسندگان
چکیده
The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has important practical applications to graph drawing. We give a linear time algorithm for computing a minimum depth embedding of a planar graphs whose biconnected components have a prescribed embedding.
منابع مشابه
Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time
Consider an n-vertex planar graph G. We present an O(n)-time algorithm for computing an embedding of G with minimum distance from the external face. This bound improves on the best previous bound by an O(n log n) factor. As a side effect, our algorithm improves the bounds of several algorithms that require the computation of a minimum distance embedding.
متن کاملImage Bit-Depth Enhancement via Maximum A Posteriori Estimation of AC Signal
When images at low bit-depth are rendered at high bit-depth displays, missing least significant bits need to be estimated. We study the image bit-depth enhancement problem: estimating an original image from its quantized version from a minimum mean squared error (MMSE) perspective. We first argue that a graph-signal smoothness prior-one defined on a graph embedding the image structure-is an app...
متن کاملPage Number Problem: an Evaluation of Heuristics and Its Solution Using a Hybrid Evolutionary Algorithm
The page number problem is to determine the minimum number of pages in a book in which a graph G can be embedded with the vertices placed in a sequence along the spine and the edges on the pages of the book such that no two edges cross each other in any drawing. In this paper we have (a) statistically evaluated five heuristics for ordering vertices on the spine for minimum number of edge crossi...
متن کاملHow to draw the minimum cuts of a planar graph
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus is transformed into a hierarchical clustering of the graph that contains complete information on all the minimum cuts. This approach is then extended to drawings in which the two vertex subsets of every minimum cut ar...
متن کاملNew techniques for approximating optimal substructure problems in power-law graphs
The remarkable discovery of many large-scale real networks is the power-law distribution in degree sequence: the number of vertices with degree i is proportional to i−β for some constant β > 1. A lot of researchers believe that it may be easier to solve some optimization problems in powerlaw graphs. Unfortunately, many problems have been proved NP-hard even in power-law graphs. Intuitively, a t...
متن کامل